Description of Fuzzy First-Order Modal Logic Based on Constant Domain Semantics
نویسندگان
چکیده
As an extension of the traditional modal logic, the fuzzy first-order modal logic is discussed in this paper. A description of fuzzy first-order modal logic based on constant domain semantics is given, and a formal system of fuzzy reasoning based on the semantic information of models of first-order modal logic is established. It is also introduced in this paper the notion of the satisfiability of the reasoning system and some properties associated with the satisfiability are proved.
منابع مشابه
A van Benthem Theorem for Fuzzy Modal Logic
We present a fuzzy (or quantitative) version of the van Benthem theorem, which characterizes propositional modal logic as the bisimulation-invariant fragment of first-order logic. Specifically, we consider a first-order fuzzy predicate logic alongwith its modal fragment, and show that the fuzzy first-order formulas that are non-expansive w.r.t. the natural notion of bisimulation distance are ex...
متن کاملImplementing Connection Calculi for First-order Modal Logics
This paper presents an implementation of an automated theorem prover for first-order modal logic that works for the constant, cumulative, and varying domain of the modal logics D, T, S4, and S5. It is based on the connection calculus for classical logic and uses prefixes representing world paths and a prefix unification algorithm to capture the restrictions given by the Kripke semantics of the ...
متن کاملFurther Study of the Fuzzy Reasoning Based on Propositional Modal Logic
The notion of the fuzzy assertion based on propositional modal logic is introduced and the properties of the fuzzy reasoning based on fuzzy assertions are studied. As an extending of the traditional semantics of modal logics, the fuzzy Kripke semantics is considered and a formal fuzzy reasoning system based on fuzzy constraint is established. In order to decide whether a fuzzy assertion is a lo...
متن کاملFMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends
A converter from first-order modal logics to classical higherorder logic is presented. This tool enables the application of off-the-shelf higher-order theorem provers and model finders for reasoning within firstorder modal logics. The tool supports logics K, K4, D, D4, T, S4, and S5 with respect to constant, varying and cumulative domain semantics.
متن کاملExploring Extensions of Possibilistic Logic over Gödel Logic
In this paper we present completeness results of several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. In a first attempt, based on different characterizations of necessity measures on fuzzy sets, a group of logics, with Kripke style semantics, are built over a restricted language, indeed a two level language compose...
متن کامل